Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)
نویسندگان
چکیده
The Satisfiability Modulo Theories Competition (SMT-COMP) arose from the SMT-LIB initiative to spur adoption of common, community-designed formats, and to spark further advances in satisfiability modulo theories (SMT). The first SMT-COMP was held in 2005 as a satellite event of CAV 2005. SMT-COMP 2006 was held August 17 19, 2006, as a satellite event of CAV 2006. This paper describes the rules and competition format for SMT-COMP 2006, the benchmarks used, the participants, and the results.
منابع مشابه
Design and Results of the 3rd Annual Satisfiability Modulo Theories Competition (SMT-Comp 2007)
The Satisfiability Modulo Theories Competition (SMT-COMP) is an annual competition aimed at stimulating the advance of the state-of-the-art techniques and tools developed by the Satisfiability Modulo Theories (SMT) community. As with the first two editions, SMT-COMP 2007 was held as a satellite event of CAV 2007, held July 3-7, 2007. This paper gives an overview of the rules, competition format...
متن کاملSMT-COMP: Satisfiability Modulo Theories Competition
Decision procedures for checking satisfiability of logical formulas are crucial for many verification applications (e.g., [2, 6, 3]). Of particular recent interest are solvers for Satisfiability Modulo Theories (SMT). SMT solvers decide logical satisfiability (or dually, validity) with respect to a background theory in classical first-order logic with equality. Background theories useful for ve...
متن کاملBarcelogic SAT Solver: System description
Our original aim for developing it was the need of a DPLL-based engine for our DPLL(T ) approach to Satisfiability Modulo Theories (SMT): deciding the satisfiability of ground first-order formulas with respect to background theories such as equality, linear integer or real arithmetic, arrays, etc. A DPLL(T ) system consists of a general DPLL(X) engine, very similar in nature to a SAT solver, wh...
متن کاملTo Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in SMT(EUF ÈT)
Satisfiability Modulo Theories (SMT(T )) is the problem of deciding the satisfiability of a formula with respect to a given background theory T . When T is the combination of two simpler theories T1 and T2 (SMT(T1 ∪T2)), a standard and general approach is to handle the integration of T1 and T2 by performing some form of search on the equalities between the shared variables. A frequent and very ...
متن کاملTo Ackermann - ize or not to Ackermann - ize ? On Efficiently Handling
Satisfiability Modulo Theories (SMT(T )) is the problem of deciding the satisfiability of a formula with respect to a given background theory T . When T is the combination of two simpler theories T1 and T2 (SMT(T1 ∪T2)), a standard and general approach is to handle the integration of T1 and T2 by performing some form of search on the equalities between the shared variables. A frequent and very ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Formal Methods in System Design
دوره 31 شماره
صفحات -
تاریخ انتشار 2007